Computational complexity with experiments as oracles
نویسندگان
چکیده
منابع مشابه
Computational complexity with experiments as oracles
We discuss combining physical experiments with machine computations and introduce a form of analogue-digital Turing machine. We examine in detail a case study where an experimental procedure based on Newtonian kinematics is combined with a class of Turing machines. Three forms of analogue-digital machine are studied, in which physical parameters can be set exactly and approximately. Using non-u...
متن کاملComputational complexity with experiments as oracles . II . Upper bounds
Earlier, to explore the idea of combining physical experiments with algorithms, we introduced a new form of analogue–digital (AD) Turing machine. We examined in detail a case study where an experimental procedure, based on Newtonian kinematics, is used as an oracle with classes of Turing machines. The physical cost of oracle calls was counted and three forms of AD queries were studied, in which...
متن کاملPhysical Experiments as Oracles
Over the past six years we have developed a methodology, some mathematical theory, and several applications, exploring physical foundations for computability and complexity. Enough of our theory and case studies have been published, sometimes in media remote from theoretical computer science, to warrant a short review of our approach and results. Our aim of this review is to arouse curiosity, n...
متن کاملAxiomatizing physical experiments as oracles to algorithms.
We developed earlier a theory of combining algorithms with physical systems, on the basis of using physical experiments as oracles to algorithms. Although our concepts and methods are general, each physical oracle requires its own analysis, on the basis of some fragment of physical theory that specifies the equipment and its behaviour. For specific examples of physical systems (mechanical, opti...
متن کاملEntropy as Computational Complexity
If the given problem instance is partially solved, we want to minimize our effort to solve the problem using that information. In this paper we introduce the measure of entropy, H(S), for uncertainty in partially solved input data S(X) = (X1, ..., Xk), where X is the entire data set, and each Xi is already solved. We propose a generic algorithm that merges Xi’s repeatedly, and finishes when k b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
سال: 2008
ISSN: 1364-5021,1471-2946
DOI: 10.1098/rspa.2008.0085